On classifying abduction
نویسندگان
چکیده
منابع مشابه
On Classifying Abduction
We can witness the recent surge of interest in classifying different patterns or types of abduction. Many philosophers, including Thagard, Magnani, Gabbay and Woods, Schurz, and Hoffmann, have suggested their own classifications emphasizing different aspects of abduction (Thagard 1988; Magnani 2001, 2009; Gabbay and Woods 2005; Schurz 2008; Hoffmann 2011). Such a development is remarkable, in v...
متن کاملOn Classifying Abduction
We can witness the recent surge of interest in classifying different patterns or types of abduction. Many philosophers, including Thagard, Magnani, Gabbay and Woods, Schurz, and Hoffmann, have suggested their own classifications emphasizing different aspects of abduction (Thagard 1988; Magnani 2001, 2009; Gabbay and Woods 2005; Schurz 2008; Hoffmann 2011). Such a development is remarkable, in v...
متن کاملOn Abduction in Design
The University Repository is a digital collection of the research output of the University, available on Open Access. Copyright and Moral Rights for the items on this site are retained by the individual author and/or other copyright owners. Users may access full items free of charge; copies of full text items generally can be reproduced, displayed or performed and given to third parties in any ...
متن کاملOn “Model-based” Abduction
This paper reports on a concerted effort to axiomatize social science theories in first order logic. Most social science theories are stated in ordinary language (like essay-style articles in social science journals). The natural language argumentation is usually sketchy and incomplete, relying on the reader’s common-sense or on familiarity with common background assumptions in the substantive ...
متن کاملOn Computing Constraint Abduction Answers
We address the problem of computing and representing answers of constraint abduction problems over the Herbrand domain. This problem is of interest when performing type inference involving generalized algebraic data types. We show that simply recognizing a maximally general answer or fully maximal answer is co-NP complete. However we present an algorithm that computes the (finite) set of fully ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Logic
سال: 2015
ISSN: 1570-8683
DOI: 10.1016/j.jal.2015.04.001